Graphs That Are Randomly Traceable from a Vertex
نویسنده
چکیده
A graph G is randomly traceable from one of its vertices v if every path in G starting at v can be extended to a hamiltonian path of G that starts at v. A complete classification of these graphs will be given, and some corollaries will be stated. Also, a few related concepts will be briefly discussed.
منابع مشابه
Matching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملOn non-traceable, non-hypotraceable, arachnoid graphs
Motivated by questions concerning optical networks, in 2003 Gargano, Hammar, Hell, Stacho, and Vaccaro defined the notions of spanning spiders and arachnoid graphs. A spider is a tree with at most one branch (vertex of degree at least 3). The spider is centred at the branch vertex (if there is any, otherwise it is centred at any of the vertices). A graph is arachnoid if it has a spanning spider...
متن کاملCycles in k-traceable oriented graphs
A digraph of order at least k is termed k-traceable if each of its subdigraphs of order k is traceable. It turns out that several properties of tournaments—i.e., the 2-traceable oriented graphs—extend to k-traceable oriented graphs for small values of k. For instance, the authors together with O. Oellermann have recently shown that for k = 2, 3, 4, 5, 6, all ktraceable oriented graphs are trace...
متن کاملComputational Results on the Traceability of Oriented Graphs of Small Order
A digraph D is traceable if it contains a path visiting every vertex, and hypotraceable if D is not traceable, but D − v is traceable for every vertex v ∈ V (D). Van Aardt, Frick, Katrenic̃ and Nielsen [Discrete Math. 11(2011), 1273-1280] showed that there exists a hypotraceable oriented graph of order n for every n > 8, except possibly for n = 9 or 11. These two outstanding existence questions ...
متن کاملOn constructions of hypotraceable graphs
A graph G is hypohamiltonian/hypotraceable if it is not hamiltonian/traceable, but all vertex deleted subgraphs of G are hamiltonian/traceable. Until now all hypotraceable graphs were constructed using hypohamiltonian graphs; extending a method of Thomassen [8] we present a construction that uses so-called almost hypohamiltonian graphs (nonhamiltonian graphs, whose vertex deleted subgraphs are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993